Diffusion Limits of the Random Walk Metropolis Algorithm in High Dimensions by Jonathan
نویسندگان
چکیده
Diffusion limits of MCMC methods in high dimensions provide a useful theoretical tool for studying computational complexity. In particular, they lead directly to precise estimates of the number of steps required to explore the target measure, in stationarity, as a function of the dimension of the state space. However, to date such results have mainly been proved for target measures with a product structure, severely limiting their applicability. The purpose of this paper is to study diffusion limits for a class of naturally occurring high-dimensional measures found from the approximation of measures on a Hilbert space which are absolutely continuous with respect to a Gaussian reference measure. The diffusion limit of a random walk Metropolis algorithm to an infinite-dimensional Hilbert space valued SDE (or SPDE) is proved, facilitating understanding of the computational complexity of the algorithm.
منابع مشابه
Diffusion Limits of the Random Walk Metropolis Algorithm in High Dimensions
Diffusion limits of MCMC methods in high dimensions provide a useful theoretical tool for studying computational complexity. In particular, they lead directly to precise estimates of the number of steps required to explore the target measure, in stationarity, as a function of the dimension of the state space. However, to date such results have mainly been proved for target measures with a produ...
متن کاملSPDE Limits of the Random Walk Metropolis Algorithm in High Dimensions
Mathematics Institute Warwick University CV4 7AL, UK e-mail: [email protected] Abstract: Diffusion limits of MCMC methods in high dimensions provide a useful theoretical tool for studying efficiency. In particular they facilitate precise estimates of the number of steps required to explore the target measure, in stationarity, as a function of the dimension of the state space. However, to...
متن کاملComplexity bounds for Markov chain Monte Carlo algorithms via diffusion limits
We connect known results about diffusion limits of Markov chain Monte Carlo (MCMC) algorithms to the computer science notion of algorithm complexity. Ourmain result states that any weak limit of a Markov process implies a corresponding complexity bound (in an appropriate metric). We then combine this result with previously-known MCMC diffusion limit results to prove that under appropriate assum...
متن کاملComplexity Bounds for MCMC via Diffusion Limits
We connect known results about diffusion limits of Markov chain Monte Carlo (MCMC) algorithms to the Computer Science notion of algorithm complexity. Our main result states that any diffusion limit of a Markov process implies a corresponding complexity bound (in an appropriate metric). We then combine this result with previously-known MCMC diffusion limit results to prove that under appropriate...
متن کاملOPTIMAL SCALINGS FOR LOCAL METROPOLIS–HASTINGS CHAINS ON NONPRODUCT TARGETS IN HIGH DIMENSIONS By Alexandros Beskos,
We investigate local MCMC algorithms, namely the random-walk Metropolis and the Langevin algorithms, and identify the optimal choice of the local step-size as a function of the dimension n of the state space, asymptotically as n→∞. We consider target distributions defined as a change of measure from a product law. Such structures arise, for instance, in inverse problems or Bayesian contexts whe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012